中英
1
combinatorial optimization problem中文是什么意思
- 中文翻譯
- 造句
- 組合最優(yōu)化問題
- optimization n. 最佳化，最優(yōu)化。
- problem n. 1.問題，課題；疑難問題；令人困惑的情況。 2.【 ...
- combinatorial optimization 組合優(yōu)化; 組合最優(yōu)化
- combinatorial problem 組合問題; 組合最優(yōu)化問題
- journal of combinatorial optimization 優(yōu)化組合雜志
- optimization problem 最佳化問題; 最優(yōu)化問題
- combinatorial covering problem 組合復蓋問題
- combinatorial matching problem 組合匹配問題
- discrete optimization problem 離散型最優(yōu)化問題; 離散最優(yōu)化問題
- linear optimization problem 線性最優(yōu)化問題
- multidimensional optimization problem 多維最優(yōu)化問題
- secondary optimization problem 次最優(yōu)化問題
- separable optimization problem 可分最優(yōu)問題
- static optimization problem 靜態(tài)最優(yōu)化問題
- combinatorial 組合的
- combinatorial algorithm 組合算法
- combinatorial analysis 組合分析
- combinatorial association 組合聯(lián)合
- combinatorial chemistry 組合化學
- combinatorial circuit 組合電路
- combinatorial closure 組合閉包
- combinatorial completeness 組合完備性
- combinatorial compression 組合壓縮
- combinatorial construction 合并結構
- A novel algorithm and its convergence for a class of combinatorial optimization problems
一類組合優(yōu)化問題的新解法及其收斂性 - This paper studies the approximation algorithms of some combinatorial optimization problems
本文主要研究組合優(yōu)化中若干問題的近似算法。 - In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given
此外，利用模擬退火算法成功地解決了該組合優(yōu)化問題。 - Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局問題是具有np完備計算復雜度的離散組合優(yōu)化問題。 - Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成組技術問題是組合優(yōu)化問題,而遺傳算法正是目前求解組合最優(yōu)化的有效方法之一。 - The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem
摘要煉鋼-連鑄生產(chǎn)的澆次組合與排序是帶有工藝約束的并行機流水車間調(diào)度問題。 - The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem
鐘手表機芯設計中齒輪參數(shù)的優(yōu)化設計問題是一個組合優(yōu)化問題,很難用傳統(tǒng)優(yōu)化方法解決。 - Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs
排序問題研究的是若干個任務要在一些機器上進行加工，如何安排機器和任務使得某些要求(目標函數(shù))達到最優(yōu)的問題。 - Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp
近些年來，人們在用遺傳算法解決現(xiàn)實中的各種組合優(yōu)化問題上進行了探索，如在生產(chǎn)調(diào)度問題中的應用，但在車輛調(diào)度問題中的應用才剛剛開始。 - In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我們分別研究了四個組合優(yōu)化問題的近似算法，并給出了它們的性能分析。
- 推薦英語閱讀
combinatorial optimization problem的中文翻譯，combinatorial optimization problem是什么意思，怎么用漢語翻譯combinatorial optimization problem，combinatorial optimization problem的中文意思，combinatorial optimization problem的中文，combinatorial optimization problem in Chinese，combinatorial optimization problem的中文，combinatorial optimization problem怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權所有違者必究。
關于我們
